package leetcode_tag.二分查找;

public class LeetCode35 {

    public int searchInsert(int[] nums, int target) {
        int l = 0, r = nums.length - 1, ans = -1;
        while (l <= r) {
            int mid = l + (r - l) / 2;
            if (nums[mid] < target) {
                ans = mid;
                l = mid + 1;
            } else
                r = mid - 1;
        }
        return ans + 1;
    }
}
